#include<bits/stdc++.h>
using namespace std;
int n,a[100005],l=1,r=1;
int main(){
    freopen("duel.in","r",stdin);
    freopen("duel.out","w",stdout);
    scanf("%d",&n);
    for(int i=1;i<=n;i++) scanf("%d",&a[i]);
    sort(a+1,a+n+1);
    while(true){
        while(a[r]==a[l]) r++;
        if(r>n) break;
        l++;
        r++;
    }
    printf("%d",n-l+1);
    return 0;
}
